LEACH-G: an Optimal Cluster-heads Selection Algorithm based on LEACH

As a classic clustering algorithm, LEACH is widely used in wireless sensor networks. Due to the random cluster head selection process, LEACH does not guarantee optimization for the number and position of cluster heads. In order to further optimize LEACH, an optimal energyefficient cluster-heads selection algorithm LEACH-G for LEACH protocol is presented. We calculate the optimal number of cluster heads based on energy model for LEACH algorithm, and further set forth on LEACH-G algorithm for optimal cluster heads. We use NS2 simulation platform to compare LEACH-G with LEACH. By calculating the optimal number of cluster-heads, the energy consumption of the sensor nodes in LEACH-G algorithm can be more evenly distributed in the wireless sensor networks to avoid too much energy consumption of single node to untimely death, which affect the network life cycle. Compared with LEACH protocol, the simulation results demonstrate that LEACH-G algorithm can effectively reduce the energy consumption and increase the system lifetime.